#-*- coding: utf-8 -*-
from typing import List


def maopao(li):
    for i in range(len(li)-1):# 第i趟
        print("i",i)
        for j  in range(len(li)-i-1):
            if li[j]>li[j+1]:
                li[j],li[j+1] = li[j+1],li[j]
    print(li)

maopao([1,2,111,4,5])

a =([1,2,3],)

class Solution:
    # 返回ListNode
    def ReverseList(self, pHead):
        # write code here
        pre = None
        head = pHead
        while head:
            temp = head.next
            head.next = pre
            pre = head
            head = temp
        return pre
ab = Solution()
